Intersections of Sets of Distance
نویسنده
چکیده
We isolate conditions on the relative asymptotic size of sets of natural numbers A,B that guarantee a nonempty intersection of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine’s Recurrence Theorem holds for all infinite sets A = {a1 < a2 < . . .} where ann n3/2.
منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملEstimating the Safety Benefits of Red Light Cameras at Signalized Intersections in Urban Areas Case Study: The City of Virginia Beach
The Highway Safety Manual [HSM, 2010] recommends safety evaluations be performed before implementing any roadway treatment to predict the expected safety consequences. Safety consequences can be measured using crash prediction models, Crash Modification Factor (CMFs), or both. This paper develops a CMF to show the expected impact of red-light cameras (RLCs) on safety at signalized intersections...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملNew distance and similarity measures for hesitant fuzzy soft sets
The hesitant fuzzy soft set (HFSS), as a combination of hesitant fuzzy and soft sets, is regarded as a useful tool for dealing with the uncertainty and ambiguity of real-world problems. In HFSSs, each element is defined in terms of several parameters with arbitrary membership degrees. In addition, distance and similarity measures are considered as the important tools in different areas such as ...
متن کاملCompleteness results for metrized rings and lattices
The Boolean ring $B$ of measurable subsets of the unit interval, modulo sets of measure zero, has proper radical ideals (for example, ${0})$ that are closed under the natural metric, but has no prime ideal closed under that metric; hence closed radical ideals are not, in general, intersections of closed prime ideals. Moreover, $B$ is known to be complete in its metric. Togethe...
متن کامل